Which tree has the smallest ABC index among trees with k leaves?
نویسندگان
چکیده
منابع مشابه
Tree-weighted neighbors and geometric k smallest spanning trees
We compute the k smallest spanning trees of a point set in the planar Euclidean metric in time O(n log n log k+kmin(k, n) log(k/n)), and in the rectilinear metrics in time O(n log n + n log logn log k + kmin(k, n) log(k/n)). In three or four dimensions our time bound is O(n + kmin(k, n) log(k/n)), and in higher dimensions the bound is O(n2−2/(dd/2e+1)+2 + kn log n).
متن کاملThe Smallest Randić Index for Trees
The general Randić index Rα(G) is the sum of the weight d(u)d(v)α over all edges uv of a graph G, where α is a real number and d(u) is the degree of the vertex u of G. In this paper, for any real number α = 0, the first three minimum general Randić indices among trees are determined, and the corresponding extremal trees are characterized.
متن کاملK-Smallest Spanning Tree Segmentations
Real-world images often admit many different segmentations that have nearly the same quality according to the underlying energy function. The diversity of these solutions may be a powerful uncertainty indicator. We provide the crucial prerequisite in the context of seeded segmentation with minimum spanning trees (i.e. edge-weighted watersheds). Specifically, we show how to efficiently enumerate...
متن کاملFinding the k Smallest Spanning Trees
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log β(m,n) + k2); for planar graphs this bound can be improved to O(n+ k2). We also show that the k best spanning trees for a set of points in the plane can be computed in time O(min(k2n + n log n, k2 + kn log(n/k))). The k best orth...
متن کاملGraphs with smallest forgotten index
The forgotten topological index of a molecular graph $G$ is defined as $F(G)=sum_{vin V(G)}d^{3}(v)$, where $d(u)$ denotes the degree of vertex $u$ in $G$. The first through the sixth smallest forgotten indices among all trees, the first through the third smallest forgotten indices among all connected graph with cyclomatic number $gamma=1,2$, the first through<br /...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.05.008